翻訳と辞書 Words near each other ・ Halsman murder case ・ Halsnæs Municipality ・ Halsnøy ・ Halsnøy Abbey ・ Halsnøy IL ・ Halsnøy Tunnel ・ Halsou ・ Halstad ・ Halstad Township, Norman County, Minnesota ・ Halstad, Minnesota ・ Halstatt Formation ・ Halstead ・ Halstead (disambiguation) ・ Halstead and Emily Lindsley House ・ Halstead Cell ・ Halstead complexity measures ・ Halstead High School ・ Halstead Place ・ Halstead Property ・ Halstead railway station ・ Halstead Rural District ・ Halstead Town F.C. ・ Halstead Township, Harvey County, Kansas ・ Halstead's Bay ・ Halstead's Point, Virginia ・ Halstead, Kansas ・ Halstead, Kent ・ Halstead-Reitan Neuropsychological Battery ・ Halsted ・ Halsted (CTA Green Line Lake Street branch station) Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Halstead complexity measures ： ウィキペディア英語版 Halstead complexity measures Halstead complexity measures are software metrics introduced by Maurice Howard Halstead in 1977 as part of his treatise on establishing an empirical science of software development. Halstead made the observation that metrics of the software should reflect the implementation or expression of algorithms in different languages, but be independent of their execution on a specific platform. These metrics are therefore computed statically from the code. Halstead's goal was to identify measurable properties of software, and the relations between them. This is similar to the identification of measurable properties of matter (like the volume, mass, and pressure of a gas) and the relationships between them (analogous to the gas equation). Thus his metrics are actually not just complexity metrics. == Calculation == For a given problem, Let: * $\backslash ,\backslash eta\_1$ = the number of distinct operators * $\backslash ,\backslash eta\_2$ = the number of distinct operands * $\backslash ,N\_1$ = the total number of operators * $\backslash ,N\_2$ = the total number of operands From these numbers, several measures can be calculated: * Program vocabulary: $\backslash eta\; =\; \backslash eta\_1\; +\; \backslash eta\_2\; \backslash ,$ * Program length: $N\; =\; N\_1\; +\; N\_2\; \backslash ,$ * Calculated program length: $\backslash hat\; =\; \backslash eta\_1\; \backslash log\_2\; \backslash eta\_1\; +\; \backslash eta\_2\; \backslash log\_2\; \backslash eta\_2$ * Volume: $V\; =\; N\; \backslash times\; \backslash log\_2\; \backslash eta$ * Difficulty : $D\; =\; \backslash times$ * Effort: $E\; =\; D\; \backslash times\; V$ The difficulty measure is related to the difficulty of the program to write or understand, e.g. when doing code review. The effort measure translates into actual coding time using the following relation, * Time required to program: $T\; =$ seconds Halstead's delivered bugs (B) is an estimate for the number of errors in the implementation. *Number of delivered bugs : $B\; =$ or, more recently, $B\; =$ is accepted . 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Halstead complexity measures」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.